List backbone colouring of graphs
نویسندگان
چکیده
منابع مشابه
List backbone colouring of graphs
Suppose G is a graph and H is a subgraph of G. Let L be a mapping that assigns to each vertex v of G a set L(v) of positive integers. We say (G,H) is backbone L-colourable if there is a proper vertex colouring c of G such that c(v) ∈ L(v) for all v ∈ V , and |c(u) − c(v)| > 2 for every edge uv in H . We say (G,H) is backbone k-choosable if (G,H) is backbone Lcolourable for any list assignment L...
متن کاملList circular backbone colouring
A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge. In the q-backbone colouring problem, these minimum distances are either q or 1, depending on whether or not the edge is in the backbone. In this paper we consider the list version o...
متن کاملGame List Colouring of Graphs
We consider the two-player game defined as follows. Let (G,L) be a graph G with a list assignment L on its vertices. The two players, Alice and Bob, play alternately on G, Alice having the first move. Alice’s goal is to provide an L-colouring of G and Bob’s goal is to prevent her from doing so. A move consists in choosing an uncoloured vertex v and assigning it a colour from the set L(v). Adjac...
متن کامل3-List Colouring Permutation Graphs
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation graphs.
متن کاملList Colouring Squares of Planar Graphs
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most ⌊ 3 2 ∆ ⌋ +1. We show that it is at most 32 ∆(1+ o(1)), and indeed this is true for the list chromatic number and for more general classes of graphs. Key-words: colouring, list colouring, planar graph, square of a graph Part of the research for this paper was done dur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.11.008